Section: New Software and Platforms

ComplexityParser

Keywords: Complexity - Static typing - Parsing

Functional Description: ComplexityParser is a static complexity analyzer of Java programs written in Java (approximatively 5000 lines of code). The program consists in a type inference and checking program based on the data tiering principle. It allows the program to certify that the typed program has a polynomial time complexity.

• Participants: Olivier Zeyen, Emmanuel Hainry, Romain Péchoux and Emmanuel Jeandel

• Contact: Emmanuel Hainry